Every planar graph is 1-defective <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e199" altimg="si22.svg"><mml:mrow><mml:mo>(</mml:mo><mml:mn>9</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math>-paintable

Assume G is a graph, and k,d,m are natural numbers. The d-defective (k,m)-painting game on played by two players: Lister Painter. Initially, each vertex has k tokens uncolored. In round, chooses set M of vertices removes one token from chosen vertex. Painter colors subset X which induces subgraph G[X] maximum degree at most d. A v fully colored if received m colors. wins the end some there with no more left not colored. Otherwise, all wins. We say (k,m)-paintable winning strategy in this game. prove that every planar graph 1-defective (9,2)-paintable. addition, our also implies (⌈92m⌉,m)-paintable for any positive m.